|
In mathematics, the term mapping, usually shortened to map, refers to either *A function, often with some sort of special structure, or *A morphism in category theory, which generalizes the idea of a function. There are also a few, less common uses in logic and graph theory. ==Maps as functions== (詳細はfunction, sometimes with a specific property of particular importance to that branch. For instance, a "map" is a ''continuous function'' in topology, a ''linear transformation'' in linear algebra, etc. Some authors, such as Serge Lang, use "function" only to refer to maps in which the codomain is a set of numbers, i.e., a subset of the fields R or C, and the term ''mapping'' for more general functions. Sets of maps of special kinds are the subjects of many important theories: see for instance Lie group, mapping class group, permutation group. In the theory of dynamical systems, a map denotes an evolution function used to create discrete dynamical systems. See also Poincaré map. A ''partial map'' is a ''partial function'', and a ''total map'' is a ''total function''. Related terms like ''domain'', ''codomain'', ''injective'', ''continuous'', etc. can be applied equally to maps and functions, with the same meaning. All these usages can be applied to "maps" as general functions or as functions with special properties. In the communities surrounding programming languages that treat functions as first class citizens, a map often refers to the binary higher-order function that takes a function ƒ and a list () as arguments and returns (), s.t. ''n'' ≥ 0. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Map (mathematics)」の詳細全文を読む スポンサード リンク
|